package com.kehao.leetcode.basic.others;

public class ReverseBitsSolution {
    public int reverseBits(int n) {
        int result = 0;
        for (int i =0;i<32;i++){
            result<<=1;
            result |= n&1;
            n=n>>>1;
        }
        return result;
    }
}

